Toward scalable FETI algorithm for variational inequalities with applications to composites
نویسندگان
چکیده
منابع مشابه
Quadratic Programming and Scalable Algorithms for Variational Inequalities
We first review our recent results concerning optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems. The unique feature of these algorithms is the rate of convergence in terms of bounds on the spectrum of the Hessian of the cost function. Then we combine these estimates with some results on the FETI method (FETI-DP, FETI and Total FETI) to get t...
متن کاملOn Scalable Algorithms for Numerical Solution of Variational Inequalities Based on FETI and Semi-monotonic Augmented Lagrangians
Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then optionally modified by means of orthogonal projectors to the natural coars...
متن کاملOptimal Penalty-feti Method for Variational Inequalities
We shall first briefly review our results related to solving of the convex box constrained quadratic programming problems by combination of the active set strategy and the conjugate gradient method with projections [1]. In particular, we shall show that with proper modification of the proportioning algorithm with projection [2], it is possible give the rate of convergence in terms of the spectr...
متن کاملPreconditioning for Bound Constrained Quadratic Programming Problems Arising from Discretization of Variational Inequalities
The active set based MPRGP (modified proportioning with reduced gradient projection) [1] for the solution of partially bound constrained quadratic programming problems turned out to be an important ingredient in development of scalable algorithms for the solution of variational inequalities by FETI [3] and BETI [4] domain decomposition methods. The algorithm was proved to have R-linear rate of ...
متن کاملProjector preconditioning for partially bound-constrained quadratic optimization
Preconditioning by a conjugate projector is combined with the recently proposed MPRGP algorithm for the solution of bound constrained quadratic programming problems. If applied to the partially bound constrained problems, such as those arising from the application of FETI based domain decomposition methods to the discretized elliptic boundary variational inequalities, the resulting algorithm is...
متن کامل